The Fully Dated Airline Crew Pairing by Genetic Algoritms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective Optimization Genetic Algorithms for Domestic Airline Crew Pairing Problems

Airline crew pairing problems involve assigning the required crew members to each flight segment in a given time period, while complying with a variety of work regulations and collective agreements. Traditional researches formulate the pairing problems as integer programming problems, and use deterministic approaches to optimize the solutions. Such these approaches usually suffer from some crit...

متن کامل

Robust Airline Crew Pairing: Move-up Crews

Due to irregular operations, the crew cost at the end of a month is typically substantially higher than the projected crew cost in planning. We assume that the fleeting and the aircraft routing decisions have already been made. We present a model and a solution methodology that produces robust crew schedules in planning. Besides the objective of minimizing the crew cost, we introduce the object...

متن کامل

Column Generation and the Airline Crew Pairing Problem

The cost of ight crews is the second largest operating cost of an airline. Minimizing it is a fundamental problem in airline planning and operations, and one which has leant itself to mathematical optimization. We discuss several recent advances in the methods used to solve these problems. After describing the general approach taken, we discuss a new method which can be used to obtain approxima...

متن کامل

A Subsequence Generation Approach for the Airline Crew Pairing Problem

In this paper we consider an important problem for the airline industry. The widely studied crew pairing problem is typically formulated as a set partitioning problem and solved using the branchand-price methodology. Here we develop a new integer programming framework, based on the concept of subsequence generation, for solving the set partitioning formulation. In subsequence generation one res...

متن کامل

Cockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach

Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence

سال: 2001

ISSN: 1346-0714,1346-8030

DOI: 10.1527/tjsai.16.324